Einfluss eines durchblutungsfördernden Einreibe-Massagemittels auf die Anzahl der durchgeführten Schulter- und Nackenübungen am Arbeitsplatz

Zusammenfassung STUDIENDESIGN: Eine randomisierte kontrollierte Studie. ZIELE: Vergleich der Anzahl der durchgeführten Schulter- und Nackenübungen bei Büroangestellten mit oder ohne Kopf-, Schulter- oder Nackenschmerzen (KSNS) zwischen einer Gruppe Perskindol und einer Kontrollgruppe. TEILNEHMER: 18 weibliche und 36 männliche Büroangestellte (n=54) im Alter von 17 bis 60 Jahren mit oder ohne KSNS. METHODEN: Die Probanden wurden in zwei homogene Gruppen randomisiert. Die Testpersonen der Gruppe Perskindol und der Kontrollgruppe führten nach einmaliger Instruktion am Arbeitsplatz täglich eine isometrische Stabilisationsübung für die Nackenmuskulatur und vier Kräftigungs- und Dehnungsübungen für die Schulter- und Nackenmuskulatur durch. Die Probanden der Gruppe Perskindol wendeten zusätzlich zu den Übungen täglich PERSKINDOL CLASSIC im Kopf-, Schulter- und/oder Nackenbereich an. Die Anzahl der durchgeführten Übungen wurde nach Abschluss der Intervention (bei follow up 1) anhand von Übungskalendern gemessen. RESULTATE: Die Probanden der Gruppe Perskindol führten die Übungen häufiger durch als diejenigen der Kontrollgruppe. Für den Monat Oktober 2005 gab es einen mittelgrossen Effekt in Bezug auf die Anzahl der durchgeführten Übungen (ES=0.52), für die Monate November 2005 (ES=0.30), Dezember 2005 (ES=0.22) und für das Total der Monate Oktober bis Dezember 2005 (ES=0.34) war dieser Effekt klein. Der Unterschied zwischen den beiden Gruppen war für die Monate Oktober (p=0.019) und Dezember (p=0.030) signifikant, jedoch nicht für den Monat November (p=0.181) und für das Total der Monate Oktober bis Dezember (p=0.141). SCHLUSSFOLGERUNG: PERSKINDOL CLASSIC hat dazu beigetragen, dass es für den Monat Oktober 2005 zu einem mittelgrossen Effekt zwischen der Gruppe Perskindol und der Kontrollgruppe in Bezug auf die Anzahl der durchgeführten Schulter- und Nackenübungen gekommen ist. Den Resultaten zufolge wurden die Übungen von der Gruppe Perskindol häufiger ausgeführt als von der Kontrollgruppe. Langfristig (nach drei Monaten) war der Effekt zwischen beiden Gruppen klein, aber statistisch signifikant. Spezifische Stabilisationsübungen für den Nacken und Kräftigungs- und Dehnungsübungen der Schulterund Nackenmuskulatur am Arbeitsplatz können bei Büroangestellten mit KSNS effizient sein.STUDY DESIGN: A randomized controlled trial. OBJECTIVES: Comparison of the performed number of shoulder and neck exercises in office employees suffering or not from headache, shoulder or neck pain between a group Perskindol and a control group. SUBJECTS: 18 female and 36 male office employees (n=54) aged 17 to 60 years suffering or not from headache, shoulder or neck pain. METHODS: Subjects were randomized into two equal groups. Subjects of the group Perskindol and of the control group were given one isometric stabilization exercise for the neck muscles and four strengthening and stretching exercises for the shoulder and neck muscles at their work place, and they were instructed to perform these every day during their work time. Every day, subjects of the group Perskindol applied in addition to the exercises the massage cream PERSKINDOL CLASSIC on the head, neck and/or shoulders. The number of performed exercises was measured at the end of the intervention (at follow up 1) by calendars. RESULTS: Subjects of the group Perskindol performed the exercises more frequently than subjects of the control group. In October 2005, there was a medium effect concerning the number of the performed exercises (ES=0.52). In November 2005 (ES=0.30) and December 2005 (ES=0.22) and for the Total of the months October till December 2005 (ES=0.34), the effect was small. The difference between the two groups was significant for the months October (p=0.019) and December (p=0.030), but there was no significance for the month November (p=0.181) and the totality of the months October till December (p=0.141). CONCLUSION: The massage cream PERSKINDOL CLASSIC contributed to the medium effect between the group Perskindol and the control group concerning the number of the performed shoulder and neck exercises for the month October 2005. As results show, exercises were performed more frequently by the group Perskindol than by the control group. In long term (after three months), the effect between both groups was small but statistically significant. Subjects of the group Perskindol remembered due to the massage cream more often the shoulder and neck exercises therefore performed these exercises more often. Specific stabilization exercises for the neck muscles and strengthening and stretching exercises for the shoulder and neck muscles at the workplace may be efficient in reducing headache, shoulder or neck pain in office employees

An Introduction to Clique Minimal Separator Decomposition

International audienceThis paper is a review which presents and explains the decomposition of graphs by clique minimal separators. The pace is leisurely, we give many examples and figures. Easy algorithms are provided to implement this decomposition. The historical and theoretical background is given, as well as sketches of proofs of the structural results involved

A General Label Search to Investigate Classical Graph Search Algorithms

International audienceMany graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic process called General Label Search (GLS), which uses a labeling structure which, when specified, defines specific algorithms. We characterize the vertex orderings computable by the basic types of searches in terms of properties of their associated labeling structures. We then consider performing graph searches in the complement without computing it, and provide characterizations for some searches, but show that for some searches such as the basic Depth-First Search, no algorithm of the GLS family can exactly find all the orderings of the complement. Finally, we present some implementations and complexity results of GLS on a graph and on its complement

Organizing the atoms of the clique separator decomposition into an atom tree

International audienceWe define an atom tree of a graph as a generalization of a clique tree: its nodes are the atoms obtained by clique minimal separator decomposition, and its edges correspond to the clique minimal separators of the graph.Given a graph GG, we compute an atom tree by using a clique tree of a minimal triangulation HH of GG. Computing an atom tree with such a clique tree as input can be done in O(min(nm,m+nf))O(min(nm,m+nf)), where ff is the number of fill edges added by the triangulation. When both a minimal triangulation and the clique minimal separators of GG are provided, we compute an atom tree of GG in O(m+f)O(m+f) time, which is in O(n2)O(n2) time.We give an O(nm)O(nm) time algorithm, based on MCS, which combines in a single pass the 3 steps involved in building an atom tree: computing a minimal triangulation, constructing a clique tree, and constructing the corresponding atom tree.Finally, we present a process which uses a traversal of a clique tree of a minimal triangulation to determine the clique minimal separators and build the corresponding atom tree in O(n(n+t))O(n(n+t)) time, where tt is the number of 2-pairs of HH (tt is at most View the MathML sourcem¯−f, where View the MathML sourcem¯ is the number of edges of the complement graph); to complete this, we also give an algorithm which computes a minimal triangulation in View the MathML sourceO(n(n+m¯)) time, thus providing an approach to compute the decomposition in View the MathML sourceO(n(n+m¯)) time

Efficient clique decomposition of a graph into its atom graph

We explain how to organize the atoms resulting from clique minimal separator decomposition into a metagraph which we call the atom graph, and give an efficient recursive algorithm to compute this graph at no extra cost than computing the atoms

Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings

International audienceMany graph search algorithms use a vertex labeling to compute an ordering of the vertices. We examine such algorithms which compute a peo (perfect elimination ordering) of a chordal graph, and corresponding algorithms which compute an meo (minimal elimination ordering) of a non-chordal graph, an ordering used to compute a minimal triangulation of the input graph. \par We express all known peo-computing search algorithms as instances of a generic algorithm called MLS (Maximal Label Search) and generalize Algorithm MLS into CompMLS, which can compute any peo. \par We then extend these algorithms to versions which compute an meo, and likewise generalize all known meo-computing search algorithms. We show that not all minimal triangulations can be computed by such a graph search, and, more surprisingly, that all these search algorithms compute the same set of minimal triangulations, even though the computed meos are different. \par Finally, we present a complexity analysis of these algorithms

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree

Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edges in the computed triangulation is highly dependent on the order in which Elimination Game processes the vertices, and in general the produced triangulations are neither minimum nor minimal. In order to obtain a triangulation which is close to minimum, the Minimum Degree heuristic is widely used in practice, but until now little was known on the theoretical mechanisms involved. In this paper we show some interesting properties of Elimination Game; in particular that it is able to compute a partial minimal triangulation of the input graph regardless of the order in which the vertices are processed. This results in a new algorithm to compute minimal triangulations that are sandwiched between the input graph and the triangulation resulting from Elimination Game. One of the strengths of the new approach is that is is easily parallelizable, and thus we are able to present the first parallel algorithm to compute such sandwiched minimal triangulations. In addition, the insight that we gain through Elimination Game is used to partly explain the good behavior of the Minimum Degree algorithm. We also give a new algorithm for producing minimal triangulations that is able to use the minimum degree idea to a wider extent

The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks

Abstract We present a new tool called the "mv-decomposition", and we describe some interesting algorithmic properties about it. We propose an algorithm with a complexity of O(m) to build a mv-decomposition for each bipartite graph. We use this mv-decomposition to propose a solution to the distance-2 broadcast problem in a synchronous multi-hops radio networks where adjacent transmissions are subject to interferences. More precisely, we propose two algorithms of resolution: the first one guarantees a complete distance-2 broadcast scheme using O((log n) 2 ) slots for a time complexity of O(m(log n) 2 ), while the second builds a solution with a minimal number of transmissions for a time complexity of O(m)

On Sandewall's paper: Nonmonotonic inference rules for multiple inheritance with exceptions

AbstractSandewall (1986) presents a theory of multiple inheritance with exceptions (also called non- monotonic inheritance) based on a set of nonmonotonic inference rules, taking advantage at the same time of theories based on nonmonotonic logic as proposed by Etherington and Reiter and of path-based theories as proposed by Touretzky, Horty and Thomason. Flaws in Sandewall's set of rules are shown and a revised set of rules is proposed. This revised set is shown to provide the same conclusion sets on a hierarchy as path-based theories for three classical variants of preclusion. Moreover, although most approaches to inheritance leave it in the metalanguage, it is shown that putting preclusion in the object language provides extensions with desirable general properties which are not always true in the restricted language of conclusion sets